Joint Diagonalization of Correlation Matrices by Using Gradient Methods with Application to Blind Signal Separation

نویسندگان

  • Marcel Joho
  • Heinz Mathis
چکیده

Joint diagonalization of several correlation matrices is a powerful tool for blind signal separation. This paper addresses the blind signal separation problem for the case where the source signals are non-stationary and / or non-white, and the sensors are possibly noisy. We present cost functions for jointly diagonalizing several correlation matrices. The corresponding gradients are derived and used in a gradient-based joint-diagonalization algorithms. Several variations are given, depending on desired properties of the separation matrix, e.g., unitary separation matrix. These constraints are either imposed by adding a penalty term to the cost function or by projecting the gradient onto the desired manifold. The performance of the proposed joint-diagonalization algorithm is verified by simulating a blind signal separation application.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Diagonalization of Correlation Matrices by Using Newton Methods with Application to Blind Signal Separation

This paper addresses the blind signal separation problem in the presence of sensor noise for the case where the source signals are non-stationary and / or non-white. This problem can be formulated as a joint-diagonalization problem where the objective is to jointly diagonalize a set of correlation matrices fRpg, using a single matrix W. We derive a Newton-type algorithm for two joint-diagonaliz...

متن کامل

Gradient-based joint block diagonalization algorithms: Application to blind separation of FIR convolutive mixtures

This article addresses the problem of the non-unitary joint block diagonalization of a given set of complex matrices. Two new algorithms are provided: the first is based on a classical gradient approach and the second is based on a relative gradient approach. For each algorithm, two versions are provided: the fixed stepsize and the optimal stepsize version. Computer simulations are provided to ...

متن کامل

Blind Signal Separation of Convolutive Mixtures: A Time-Domain Joint-Diagonalization Approach

We address the blind source separation (BSS) problem for the convolutive mixing case. Second-order statistical methods are employed assuming the source signals are non-stationary and possibly also non-white. The proposed algorithm is based on a joint-diagonalization approach, where we search for a single polynomial matrix that jointly diagonalizes a set of measured spatiotemporal correlation ma...

متن کامل

A fast algorithm for joint diagonalization with application to blind source separation

We present a new approach to approximate joint diagonalization of a set of matrices. The main advantages of our method are computational efficiency and generality. The algorithm is based on the Frobeniusnorm formulation of the joint diagonalization problem, and addresses diagonalization with a general, non-orthogonal transformation. The iterative scheme of the algorithm inherits the key ideas f...

متن کامل

Simultaneous diagonalization: the asymmetric, low-rank, and noisy settings

Simultaneous matrix diagonalization is used as a subroutine in many machine learning problems, including blind source separation and paramater estimation in latent variable models. Here, we extend algorithms for performing joint diagonalization to low-rank and asymmetric matrices, and we also provide extensions to the perturbation analysis of these methods. Our results allow joint diagonalizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002